Competitive Analysis of Paging: A Survey
نویسنده
چکیده
This paper is a survey of competitive analysis of paging. We present proofs showing tight bounds for the competitive ratio achievable by any deterministic or randomized online algorithm. We then go on to discuss variations and reenements of the competitive ratio and the insights they give into the paging problem. Finally, we variations to the online paging problem to which competitive analysis has been applied.
منابع مشابه
Heat & Dump: Competitive Distributed Paging
This paper gives a randomized competitive distributed paging algorithm called Heat & Dump. The competitive ratio is logarithmic in the total storage capacity of the network, this is optimal to within a constant factor. This is in contrast to the linear optimal deterministic competitive ratio BFR].
متن کاملBroadcast Disk Paging with a Small Cache
We consider the broadcast disk paging problem when the cache size is 2 and n pages are transmitted. We show an algorithm that is (n 2=(n 2))-competitive and prove that no better competitive ratio is possible.
متن کاملA Simple Analysis for Randomized Online Weighted Paging
We describe a new potential function based proof for anO(log k)-competitive algorithm for weighted paging, and more generally anO(log k/(k−h+1))-competitive algorithm for the weighted (h, k)-paging problem. In contrast to previous results that are based on the online primal-dual framework, our analysis is extremely simple, and we believe that the technique might be useful in the analysis of oth...
متن کاملTheoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
The paging algorithm LRU-2 was proposed for use in database disk buffering and shown experimentally to perform better than LRU [O’Neil, O’Neil, and Weikum, 1993]. We compare LRU-2 and LRU theoretically, using both the standard competitive analysis and the newer relative worst order analysis. The competitive ratio for LRU-2 is shown to be 2k for cache size k, which is worse than LRU’s competitiv...
متن کاملOn the optimality of Least Recently Used
It is well known that competitive analysis yields results that do not reflect the observed performance of online paging algorithms. Many deterministic paging algorithms achieve the same competitive ratio, ranging from inefficient strategies as flush-when-full to the well-performing leastrecently-used (LRU). In this paper, we study this fundamental online problem from the viewpoint of stochastic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996